Maximum cut - PDFSEARCH.IO - Document Search Engine

Maximum cut
Results: 105

#	Item
61	Robust Approximation of CSPs V´ıctor Dalmau (joint work with A. Krokhin) Universitat Pompeu Fabra Robust Approximation of CSPs – p. 1/3 Add to Reading List Source URL: www.fields.utoronto.ca Language: English - Date: 2011-08-15 16:22:53 Combinatorial optimization NP-complete problems Computational complexity theory Approximation algorithm Maximum cut Cut Constraint programming Constraint satisfaction problem Theoretical computer science Graph theory Mathematics
62	Microsoft Word - minreg-fmcad-final3.doc Add to Reading List Source URL: www.bvsrc.org Language: English - Date: 2007-07-30 11:41:26 Combinatorial optimization Formal methods Combinatorics Retiming Maximum flow problem Flow network Minimum cut Cut Minimum-cost flow problem Network flow Graph theory Mathematics
63	Expander Flows, Geometric Embeddings and Graph Partitioning SANJEEV ARORA Princeton University SATISH RAO and UMESH VAZIRANI Add to Reading List Source URL: snap.stanford.edu Language: English - Date: 2013-09-11 13:19:18 Combinatorial optimization NP-complete problems Cut Maximum flow problem Graph embedding Matching Vertex cover Big O notation Graph coloring Mathematics Theoretical computer science Graph theory
64	CS787: Advanced Algorithms[removed]Lecture 5 addendum: LP Duality Add to Reading List Source URL: pages.cs.wisc.edu Language: English - Date: 2009-09-26 00:08:11 Operations research Duality Combinatorial optimization Max-flow min-cut theorem Strong duality Constraint Maximum flow problem Semidefinite programming Mathematical optimization Convex optimization Linear programming
65	Florida Lottery Retailers SALES AREA Floor Surface Floor mats must not exceed 1/2 inch in height. Floor mats must be secure, and must not slide. Carpet must be low pile (maximum 1/2 inch), Add to Reading List Source URL: es.flalottery.com Language: English - Date: 2010-08-06 15:20:01 Parking Parking space Accessibility Disabled parking permit Curb cut Americans with Disabilities Act Aisle Disability Transport Land transport Disability rights
66	SODA15 – Accepted Papers Martin Skutella A note on the ring loading problem Marco Di Summa, Friedrich Eisenbrand, Yuri Faenza and Carsten Moldenhauer. On largest volume simplices and sub-determinants Seth Pettie Add to Reading List Source URL: www.siam.org Language: English - Date: 2014-10-08 09:27:53 NP-complete problems Combinatorial optimization Vertex cover Approximation algorithm Matching Algorithm Linear programming Polynomial-time approximation scheme Maximum cut Theoretical computer science Mathematics Applied mathematics
67	SODA15 – Accepted Papers Martin Skutella A note on the ring loading problem Marco Di Summa, Friedrich Eisenbrand, Yuri Faenza and Carsten Moldenhauer. On largest volume simplices and sub-determinants Seth Pettie Add to Reading List Source URL: www.siam.org Language: English - Date: 2014-10-08 09:27:53 NP-complete problems Combinatorial optimization Vertex cover Approximation algorithm Matching Algorithm Linear programming Polynomial-time approximation scheme Maximum cut Theoretical computer science Mathematics Applied mathematics
68	The Unique Games Conjecture, Integrality Gap for Cut Problems and Embeddability of Negative Type Metrics into `1 Subhash A. Khot Nisheeth K. Vishnoi Add to Reading List Source URL: www.cs.nyu.edu Language: English - Date: 2007-11-05 11:00:31 Combinatorial optimization NP-complete problems Graph connectivity Linear programming Mathematical optimization Vertex cover Cut Linear programming relaxation Maximum cut Theoretical computer science Mathematics Graph theory
69	On Khot’s unique games conjecture Add to Reading List Source URL: www.ams.org Language: English - Date: 2012-05-01 11:13:39 NP-complete problems Graph coloring Combinatorial optimization Maximum cut Cut Probabilistically checkable proof Edge coloring NP-complete Graph theory Theoretical computer science Mathematics
70	Subhash Khot Typically, major math prizes are given for major results. But in this case, Subhash Khot is receiving the Nevanlinna Prize in large part for a conjecture – and even more surprisingly, one whose truth exper Add to Reading List Source URL: www.mathunion.org Language: English - Date: 2014-07-30 08:33:48 Conjectures Combinatorial optimization NP-complete problems Mathematical optimization Unique games conjecture computational complexity theory Maximum cut Subhash Khot P versus NP problem Theoretical computer science Mathematics Applied mathematics